Existence of disjoint frequently hypercyclic operators which fail to be disjoint weakly mixing
نویسندگان
چکیده
In this short note, we answer a question of Martin and Sanders [Integr. Equ. Oper. Theory, 85 (2) (2016), 191-220] by showing the existence disjoint frequently hypercyclic operators which fail to be weakly mixing and, therefore, satisfy Disjoint Hypercyclicity Criterion. We also show that given an operator $T$ such $T \oplus T$ is hypercyclic, set $S$ $T, S$ are but Criterion SOT dense in algebra bounded linear operators.
منابع مشابه
About Subspace-Frequently Hypercyclic Operators
In this paper, we introduce subspace-frequently hypercyclic operators. We show that these operators are subspace-hypercyclic and there are subspace-hypercyclic operators that are not subspace-frequently hypercyclic. There is a criterion like to subspace-hypercyclicity criterion that implies subspace-frequent hypercyclicity and if an operator $T$ satisfies this criterion, then $Toplus T$ is sub...
متن کاملStrongly Almost Disjoint Sets and Weakly Uniform Bases
A combinatorial principle CECA is formulated and its equivalence with GCH + certain weakenings of 2λ for singular λ is proved. CECA is used to show that certain “almost point-< τ” families can be refined to point-< τ families by removing a small set from each member of the family. This theorem in turn is used to show the consistency of “every first countable T1-space with a weakly uniform base ...
متن کاملOn the Existence of Disjoint Spanning Paths in Faulty Hypercubes
Assume that n is a positive integer with n ≥ 4 and F is a subset of the edges of the hypercube Qn with |F | ≤ n−4. Let u, x be two distinct white vertices of Qn and v, y be two distinct black vertices of Qn, where black and white refer to the two parts of the bipartition of Qn. Let l1 and l2 be odd integers, where l1 ≥ dQn−F (u, v), l2 ≥ dQn−F (x,y), and l1 + l2 = 2 n − 2. Moreover, let l3 and ...
متن کاملThe existence of (v, 4, λ) disjoint difference families
A (v, k, λ) difference family ((v, k, λ)-DF in short) over an abelian group G of order v is a collection F = {Bi | i ∈ I} of k-subsets of G, called base blocks, such that each nonzero element of G can be represented in precisely λ ways as a difference of two elements lying in some base blocks in F . A disjoint (v, k, λ)-DF is a difference family with disjoint blocks. In this paper, it is proved...
متن کاملSufficient Condition for the Existence of Three Disjoint Theta Graphs
A theta graph is the union of three internally disjoint paths that have the same two distinct end vertices. We show that every graph of order n ≥ 12 and size at least ⌊ 11n−18 2 ⌋ contains three disjoint theta graphs. As a corollary, every graph of order n ≥ 12 and size at least ⌊ 11n−18 2 ⌋ contains three disjoint cycles of even length. 1. Terminology and introduction In this paper, we only co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2021
ISSN: ['0022-247X', '1096-0813']
DOI: https://doi.org/10.1016/j.jmaa.2021.125106